An Analysis of Fixed-Point Queries on Binary Trees
نویسنده
چکیده
Lindell, S., An analysis of fixed-point queries on binary trees, Theoretical Computer Science 85 (1991) 75-95. The presence of ordering appears to play an essential role in the logical expressibility of polynomialtime queries on finite structures. By examining the expressibility and complexity of inductive queries on the class of complete unordered binary trees, we are able to show that the ability to calculate cardinality is strictly less powerful than the assumption of order.
منابع مشابه
A Perron Iteration for the Solution of a Quadratic Vector Equation Arising in Markovian
We propose a novel numerical method for solving a quadratic vector equation arising in Markovian binary trees. The numerical method consists of a fixed-point iteration, expressed by means of the Perron vectors of a sequence of nonnegative matrices. A theoretical convergence analysis is performed. The proposed method outperforms the existing methods for close-to-critical problems.
متن کاملA Perron Iteration for the Solution of a Quadratic Vector Equation Arising in Markovian Binary Trees
We propose a novel numerical method for solving a quadratic vector equation arising in Markovian Binary Trees. The numerical method consists in a fixed point iteration, expressed by means of the Perron vectors of a sequence of nonnegative matrices. A theoretical convergence analysis is performed. The proposed method outperforms the existing methods for close-to-critical problems.
متن کاملPartial Match Queries in Relaxed K-dt trees
The study of partial match queries on random hierarchical multidimensional data structures dates back to Ph. Flajolet and C. Puech’s 1986 seminal paper on partial match retrieval. It was not until recently that fixed (as opposed to random) partial match queries were studied for random relaxed K-d trees, random standard K-d trees, and random 2-dimensional quad trees. Based on those results it se...
متن کاملProximity Matching Using Fixed-Queries Trees
We present a new data structure, called the xed-queries tree, for the problem of nding all elements of a xed set that are close, under some distance function, to a query element. Fixed-queries trees can be used for any distance function, not necessarily even a metric, as long as it satisses the triangle inequality. We give an analysis of several performance parameters of xed-queries trees and e...
متن کاملIntervals of balanced binary trees in the Tamari lattice
We show that the set of balanced binary trees is closed by interval in the Tamari lattice. We establish that the intervals [T, T ′] where T and T ′ are balanced binary trees are isomorphic as posets to a hypercube. We introduce synchronous grammars that allow to generate tree-like structures and obtain fixed-point functional equations to enumerate these. We also introduce imbalance tree pattern...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Theor. Comput. Sci.
دوره 85 شماره
صفحات -
تاریخ انتشار 1991